Observing the Performance of Greedy algorithms for dynamic load balancing in Heterogeneous Distributed Computing System
نویسندگان
چکیده
Distributed systems have been an active research area in computer science for the last decade, task allocation and load balancing have been a major issue associated with such systems. The load-balancing problem, attempts to compute the assignment with smallest possible makespan (i.e. the completion time at the maximum loaded computing node). Load balancing problem is a NP hard problem. This paper discusses the performance of some simple heuristic algorithms to solve load balancing problem with makespan as performance metric to minimize the makespan. Keywords— Heterogeneous distributed system, dynamic load balancing, makespan, greedy heuristic.
منابع مشابه
Analysing the Impact of Heterogeneity with Greedy Resource Allocation Algorithms for Dynamic Load Balancing in Heterogeneous Distributed Computing System
Heterogeneous Distributed systems have been an active research area in computer science for the last two decade, task allocation and load balancing have been a major issue associated with such systems. The load-balancing problem, attempts to compute the assignment with smallest possible makespan (i. e. the completion time at the maximum loaded computing node). This paper presents and discusses ...
متن کاملAdaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments
Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...
متن کاملDynamic Load Balancing Strategies in Heterogeneous Distributed System
Distributed heterogeneous computing is being widely applied to a variety of large size computational problems. This computational environments are consists of multiple heterogeneous computing modules, these modules interact with each other to solve the problem. Dynamic load balancing in distributed computing system is desirable because it is an important key to establish dependability in a Hete...
متن کاملMeasuring Performance of Dynamic Load Balancing Algorithms in Distributed Computing Applications
In distributed applications, performance issues have become more critical due to proliferation of heterogeneous devices, large variety of communication medium and increased security concerns. This paper highlights the issues in performance measurement in Dynamic Load Balancing Algorithms (DLB) used for distributed scheduling. Various parameters used to measure the performance of scheduling algo...
متن کاملA genetic-fuzzy logic based load balancing algorithm in heterogeneous distributed systems
Distributed processing is recognized as a practical way to achieve high performance in various computational applications. Many dynamic loadbalancing algorithms have been proposed for parallel and discrete simulations. But the actual performances of these algorithms have been far from ideal, especially in the heterogeneous environment. In this paper, a hybrid approach using fuzzy supervised lea...
متن کامل